Arc-presentations of links: Monotonic simplification
نویسندگان
چکیده
منابع مشابه
Monotonic Simplification and Recognizing Exchange Reducibility
In [BM4] the Markov Theorem Without Stabilization (MTWS) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to increase the braid index by stabilization. Although the calculus is extensive there are three key isotopies that were identified and analyzed—destabilization, exchange mov...
متن کاملOn the Maximum Arc Length of Monotonic Functions
We revisit a problem solved in 1963 by Zaanen & Luxemburg in this monthly: what is the largest possible length of the graph of a monotonic function on an interval? And is there such a function that attains this length? This is an interesting and intriguing problem with a somewhat surprising answer, that should be of interest to a broad spectrum of mathematicians starting with upper level underg...
متن کاملCartograms and Circular-Arc Simplification of Polygonal Subdivisions
Cartograms are proportional drawings of maps where the areas of all countries correspond to prescribed weights. Besides the property of being a proportional representation it is essential for the quality of a cartogram that the countries are not too badly deformed. A good clarity can only be achieved if all countries can easily be identified by the reader due to the fact that their principal to...
متن کاملArc Consistency on n-ary Monotonic and Linear Constraints
Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...
متن کاملA Non-Monotonic Arc-Eager Transition System for Dependency Parsing
Previous incremental parsers have used monotonic state transitions. However, transitions can be made to revise previous decisions quite naturally, based on further information. We show that a simple adjustment to the Arc-Eager transition system to relax its monotonicity constraints can improve accuracy, so long as the training data includes examples of mistakes for the nonmonotonic transitions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2006
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm190-0-3